Nuprl Lemma : R-compat-Dsys 0,22

n:A:Realizer.
R-size(A)n
 R-Feasible(A)
 [[A]]  Dsys & (B:Realizer. R-size(B)n  R-Feasible(B A || B  [[A]] || [[B]]) 
latex


Definitionsx:AB(x), P  Q, A & B, t  T, AB, A, False, ij, R-size(R), b, Rplus?(x1), Prop, xt(x), false, true, if b t else f fi, True, x,y,z,wt(x;y;z;w), x,y,zt(x;y;z), x,y,z,u,v,wt(x;y;z;u;v;w), x,y,z,w,vt(x;y;z;w;v), [[R]], SQType(T), {T}, A || B, Y, , , Dec(P), P  Q, Realizer, Unit, x(s), x(s1,s2,s3,s4), x(s1,s2,s3), x(a,b,c,d,e,f), x(s1,s2,s3,s4,s5), R-Feasible(R), P & Q, P  Q, Rplus-left(x1), Rplus-right(x1), Rnone?(x1), , , , left  right, @loc x initially v:T, @loc only events in L change x:T, only events in L send on lnk with tag, @loc effect knd(v:T)  x := f State(ds) v , sends knd(v:T) on l:tagged(g,State(ds),v):dt, @loc precondition for a(v:T):P State(ds) v, @lock writes only members of L, @lock sends only on links in L, @loc: only members of L read x
Lemmasnat wf, R-size wf, R-compat wf, R-Feasible wf, le wf, nat plus wf, es realizer wf, nat properties, ge wf, decidable le, R-Dsys-base-wf, unit wf, Id wf, Knd wf, IdLnk wf, fpf wf, decl-state wf, decl-type wf, not wf, es realizer ind wf, Rplus-implies, R-size-decreases, m-sys-join wf2, Rplus-left wf, Rplus-right wf, bool cases, Rplus? wf, bool sq, bool wf, eqtt to assert, iff transitivity, assert wf, bnot wf, eqff to assert, assert of bnot, decidable assert, R-compat-symmetry, dsys-compatible-join2, dsys-compatible-join, R-size-base, R-compat-base

origin